Diagonally-striped matrices and approximate inverse preconditioners
نویسندگان
چکیده
منابع مشابه
Approximate inverse-free preconditioners for Toeplitz matrices
In this paper, we propose approximate inverse-free preconditioners for solving Toeplitz systems. The preconditioners are constructed based on the famous Gohberg-Sememcul formula. We show that if a Toepltiz matrix is generated by a positive bounded function and its entries enjoys the off-diagonal decay property, then the eigenvalues of the preconditioned matrix are clustered around one. Experime...
متن کاملApproximate Inverse Preconditioners for General Sparse Matrices
The standard Incomplete LU (ILU) preconditioners often fail for general sparse indeenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI?AMk F , where AM is the preconditioned matrix. An iterative descent-type method...
متن کاملParallel Approximate Inverse Preconditioners
There has been much excitement recently over the use of approximate inverses for parallel preconditioning. The preconditioning operation is simply a matrix-vector product, and in the most popular formulations, the construction of the approximate inverse seems embarassingly parallel. However, diiculties arise in practical parallel implementations. This paper will survey approximate inverse preco...
متن کاملMultiresolution Approximate Inverse Preconditioners
We introduce a new preconditioner for elliptic PDE’s on unstructured meshes. Using a wavelet-inspired basis we compress the inverse of the matrix, allowing an effective sparse approximate inverse by solving the sparsity vs. accuracy conflict. The key issue in this compression is to use second-generation wavelets which can be adapted to the unstructured mesh, the true boundary conditions, and ev...
متن کاملWavelet Sparse Approximate Inverse Preconditioners
There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle [21] and Chow and Saad [11] also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse ent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2006
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.02.012